<h3 id="71-基础">§7.1 基础</h3>
<ul>
<li><a href="https://leetcode.cn/problems/properties-graph/" target="_blank">3493. 属性图</a> 1565</li>
<li><a href="https://leetcode.cn/problems/path-existence-queries-in-a-graph-i/" target="_blank">3532. 针对图的路径存在性查询 I</a> 有更简单的做法</li>
<li><a href="https://leetcode.cn/problems/satisfiability-of-equality-equations/" target="_blank">990. 等式方程的可满足性</a> 1638</li>
<li><a href="https://leetcode.cn/problems/accounts-merge/" target="_blank">721. 账户合并</a></li>
<li><a href="https://leetcode.cn/problems/sentence-similarity-ii/" target="_blank">737. 句子相似性 II</a>（会员题）</li>
<li><a href="https://leetcode.cn/problems/the-earliest-moment-when-everyone-become-friends/" target="_blank">1101. 彼此熟识的最早时间</a>（会员题）</li>
<li><a href="https://leetcode.cn/problems/synonymous-sentences/" target="_blank">1258. 近义词句子</a>（会员题）</li>
</ul>
<p>更多基础题，见 <a href="https://leetcode.cn/circle/discuss/YiXPXW/" target="_blank">网格图题单</a> 中的 DFS 和 <a href="https://leetcode.cn/circle/discuss/01LUak/" target="_blank">图论题单</a> 中的 DFS，其中大部分题目也可以用并查集实现。</p>
<h3 id="72-进阶">§7.2 进阶</h3>
<ul>
<li><a href="https://leetcode.cn/problems/minimum-swaps-to-sort-by-digit-sum/" target="_blank">3551. 数位和排序需要的最小交换次数</a> 1507 做法不止一种</li>
<li><a href="https://leetcode.cn/problems/minimum-number-of-operations-to-sort-a-binary-tree-by-level/" target="_blank">2471. 逐层排序二叉树所需的最少操作数目</a> 1635 做法不止一种</li>
<li><a href="https://leetcode.cn/problems/smallest-string-with-swaps/" target="_blank">1202. 交换字符串中的元素</a> 1855</li>
<li><a href="https://leetcode.cn/problems/lexicographically-smallest-equivalent-string/" target="_blank">1061. 按字典序排列最小的等效字符串</a></li>
<li><a href="https://leetcode.cn/problems/minimize-hamming-distance-after-swap-operations/" target="_blank">1722. 执行交换操作后的最小汉明距离</a> 1892</li>
<li><a href="https://leetcode.cn/problems/minimum-time-for-k-connected-components/" target="_blank">3608. 包含 K 个连通分量需要的最小时间</a> 1893</li>
<li><a href="https://leetcode.cn/problems/minimize-maximum-component-cost/" target="_blank">3613. 最小化连通分量的最大成本</a> 类似 3608 题</li>
<li><a href="https://leetcode.cn/problems/maximize-alternating-sum-using-swaps/" target="_blank">3695. 交换元素后的最大交替和</a> 1984</li>
<li><a href="https://leetcode.cn/problems/couples-holding-hands/" target="_blank" style="color: red;">765. 情侣牵手</a> 1999</li>
<li><a href="https://leetcode.cn/problems/redundant-connection/" target="_blank">684. 冗余连接</a> 做法不止一种</li>
<li><a href="https://leetcode.cn/problems/redundant-connection-ii/" target="_blank">685. 冗余连接 II</a></li>
<li><a href="https://leetcode.cn/problems/most-stones-removed-with-same-row-or-column/" target="_blank">947. 移除最多的同行或同列石头</a> 2035</li>
<li><a href="https://leetcode.cn/problems/similar-string-groups/" target="_blank">839. 相似字符串组</a> 2054</li>
<li><a href="https://leetcode.cn/problems/last-day-where-you-can-still-cross/" target="_blank">1970. 你能穿过矩阵的最后一天</a> 2124</li>
<li><a href="https://leetcode.cn/problems/process-restricted-friend-requests/" target="_blank">2076. 处理含限制条件的好友请求</a> 2131</li>
<li><a href="https://leetcode.cn/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/" target="_blank">1579. 保证图可完全遍历</a> 2132</li>
<li><a href="https://leetcode.cn/problems/regions-cut-by-slashes/" target="_blank">959. 由斜杠划分区域</a> 2136</li>
<li><a href="https://leetcode.cn/problems/find-the-safest-path-in-a-grid/" target="_blank">2812. 找出最安全路径</a> 2154</li>
<li><a href="https://leetcode.cn/problems/maximum-number-of-points-from-grid-queries/" target="_blank">2503. 矩阵查询可获得的最大分数</a> 2196</li>
<li><a href="https://leetcode.cn/problems/maximize-spanning-tree-stability-with-upgrades/" target="_blank">3600. 升级后最大生成树稳定性</a> 2301 做法不止一种</li>
<li><a href="https://leetcode.cn/problems/count-valid-paths-in-a-tree/" target="_blank">2867. 统计树中的合法路径数目</a> 2428</li>
<li><a href="https://leetcode.cn/problems/number-of-good-paths/" target="_blank">2421. 好路径的数目</a> 2445</li>
<li><a href="https://leetcode.cn/problems/groups-of-strings/" target="_blank">2157. 字符串分组</a> 2499</li>
<li><a href="https://leetcode.cn/problems/rank-transform-of-a-matrix/" target="_blank">1632. 矩阵转换后的秩</a> 2530</li>
<li><a href="https://leetcode.cn/problems/bricks-falling-when-hit/" target="_blank">803. 打砖块</a> 2765</li>
<li><a href="https://leetcode.cn/problems/check-if-the-rectangle-corner-is-reachable/" target="_blank">3235. 判断矩形的两个角落是否可达</a></li>
<li><a href="https://leetcode.cn/problems/kskhHQ/" target="_blank">LCP 71. 集水器</a></li>
<li><a href="https://leetcode.cn/problems/minimize-maximum-value-in-a-grid/" target="_blank">2371. 最小化网格中的最大值</a>（会员题）</li>
<li><a href="https://leetcode.cn/problems/sort-array-by-moving-items-to-empty-space/" target="_blank">2459. 通过移动项目到空白区域来排序数组</a>（会员题）置换</li>
</ul>
<p>另见 <a href="https://leetcode.cn/circle/discuss/01LUak/" target="_blank">图论题单</a> 中的最小生成树。</p>
<h3 id="73-gcd-并查集">§7.3 GCD 并查集</h3>
<ul>
<li><a href="https://leetcode.cn/problems/greatest-common-divisor-traversal/" target="_blank">2709. 最大公约数遍历</a> 2172</li>
<li><a href="https://leetcode.cn/problems/graph-connectivity-with-threshold/" target="_blank">1627. 带阈值的图连通性</a> 2221</li>
<li><a href="https://leetcode.cn/problems/largest-component-size-by-common-factor/" target="_blank">952. 按公因数计算最大组件大小</a> 2272</li>
<li><a href="https://leetcode.cn/problems/gcd-sort-of-an-array/" target="_blank">1998. 数组的最大公因数排序</a> 2429</li>
<li><a href="https://leetcode.cn/problems/count-connected-components-in-lcm-graph/" target="_blank">3378. 统计最小公倍数图中的连通块数目</a> 2532 思路类似 1627 题</li>
</ul>
<h3 id="74-数组上的并查集">§7.4 数组上的并查集</h3>
<ul>
<li><a href="https://leetcode.cn/problems/find-latest-group-of-size-m/" target="_blank">1562. 查找大小为 M 的最新分组</a> 1928</li>
<li><a href="https://leetcode.cn/problems/avoid-flood-in-the-city/" target="_blank">1488. 避免洪水泛滥</a> 1974</li>
<li><a href="https://leetcode.cn/problems/maximum-number-of-events-that-can-be-attended/" target="_blank">1353. 最多可以参加的会议数目</a> 2016</li>
<li><a href="https://leetcode.cn/problems/maximum-segment-sum-after-removals/" target="_blank">2382. 删除操作后的最大子段和</a> 2136</li>
<li><a href="https://leetcode.cn/problems/subarray-with-elements-greater-than-varying-threshold/" target="_blank">2334. 元素值大于变化阈值的子数组</a> 2381</li>
<li><a href="https://leetcode.cn/problems/minimum-operations-to-equalize-binary-string/" target="_blank">3666. 使二进制字符串全为 1 的最少操作次数</a> 2477</li>
<li><a href="https://leetcode.cn/problems/minimum-reverse-operations/" target="_blank">2612. 最少翻转操作数</a> 2824</li>
</ul>
<h3 id="75-区间并查集">§7.5 区间并查集</h3>
<ul>
<li><a href="https://leetcode.cn/problems/minimum-interval-to-include-each-query/" target="_blank">1851. 包含每个查询的最小区间</a> 2286</li>
<li><a href="https://leetcode.cn/problems/shortest-distance-after-road-addition-queries-ii/" target="_blank">3244. 新增道路查询后的最短距离 II</a> 2270</li>
<li><a href="https://leetcode.cn/problems/amount-of-new-area-painted-each-day/" target="_blank">2158. 每天绘制新区域的数量</a>（会员题）</li>
</ul>
<h3 id="76-边权并查集">§7.6 边权并查集</h3>
<ul>
<li><a href="https://leetcode.cn/problems/evaluate-division/" target="_blank">399. 除法求值</a></li>
<li><a href="https://leetcode.cn/problems/check-for-contradictions-in-equations/" target="_blank">2307. 检查方程中的矛盾之处</a>（会员题）</li>
</ul>
